Subword complexity and Sturmian colorings of regular trees
نویسندگان
چکیده
منابع مشابه
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages
A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u = v. Suffix-, factor-, and subword-free languages are defined similarly, where “subword” means “subsequence”. A language is bifix-free if it is both prefixand suffix-free. We study the quotient complexity, more commonly known as state complexity, of operations in the classes of bifix-, factor-, and su...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولOn scattered subword complexity
Sequences of characters called words or strings are widely studied in combinatorics, and used in various fields of sciences (e.g. chemistry, physics, social sciences, biology [2, 3, 4, 11] etc.). The elements of a word are called letters. A contiguous part of a word (obtained by erasing a prefix or/and a suffix) is a subword or factor. If we erase arbitrary letters from a word, what is obtained...
متن کاملSubword complexity and power avoidance
We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that – the Thue-Morse word has the minimum possible subword complexity over all overlapfree binary words and all (73)-power-free binary words, but not over all ( 7 3) +-power-free binary words; – the twisted Thue-Morse word has the maximum possible sub...
متن کاملSubword Complexity and k-Synchronization
We show that the subword complexity function ρx(n), which counts the number of distinct factors of length n of a sequence x, is k-synchronized in the sense of Carpi if x is k-automatic. As an application, we generalize recent results of Goldstein. We give analogous results for the number of distinct factors of length n that are primitive words or powers. In contrast, we show that the function t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2013
ISSN: 0143-3857,1469-4417
DOI: 10.1017/etds.2013.50